Controlled Islanding via Weak Submodularity
نویسندگان
چکیده
منابع مشابه
Scalable Greedy Feature Selection via Weak Submodularity
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for each greedy step we need to refit a model or calculate a function using the previously selected choices and the new candidate. Two algorithms that are faste...
متن کاملRestricted Strong Convexity Implies Weak Submodularity
We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several methods without statistical modeling assumptions. We also derive recovery guarant...
متن کاملActive Detection via Adaptive Submodularity
Efficient detection of multiple object instances is one of the fundamental challenges in computer vision. For certain object categories, even the best automatic systems are yet unable to produce high-quality detection results, and fully manual annotation would be an expensive process. How can detection algorithms interplay with human expert annotators? To make the best use of scarce (human) lab...
متن کاملScaling Submodular Maximization via Pruned Submodularity Graphs
5 Appendix 5.1 Proof of Lemma 3 Proof. Firstly, we have the following inequality. f(x|v) = f(x+ u|v) f(u|v + x) = f(x|u+ v) + f(u|v) f(u|v + x) f(x|u) + f(u|v) f(u|v + x). (15) The first two equalities follow from the definition of marginal gain, while the inequality is due to submodularity. Following the definition of w uv in Eq. (3), we have w vx = f(x|v) f(v|V v) f(x|u) + f(u|v) f(u|v + ...
متن کاملSampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation
We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE). To that end, we formulate the task at hand as the minimization of MSE subject to binary constraints, and approximate the resulting NP-hard problem via semidefinite program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2019
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2018.2881163